Planar bichromatic minimum spanning trees
نویسندگان
چکیده
Given a set S of n red and blue points in the plane, a planar bichromatic minimum spanning tree is the shortest possible spanning tree of S, such that every edge connects a red and a blue point, and no two edges intersect. Computing this tree is NP-hard in general. We present an O(n) time algorithm for the special case when all points are in convex position. For the general case, we present a factor O( √ n) approximation algorithm.
منابع مشابه
Optimal random matchings, tours, and spanning trees in hierarchically separated trees
We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size n distributed among the leaves of a balanced hierarchically separated tree. We consider monochromatic and bichromatic versions of the minimum matching, minimum spanning tree, and traveling salesman problems. We also present tight concentration results for the monochromatic...
متن کاملDynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in amortized time O(n1/2 log n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(n) per update. Our algorithm uses a novel construction, the ordered nearest neighbor path of a set of points. Our results generalize to higher d...
متن کاملOn the Area Requirements of Euclidean Minimum Spanning Trees
In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1992], Monma and Suri proved that any tree of maximum degree 5 admits a planar embedding as a Euclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; however, the authors conjectured that c × c area is sometimes required to embed an n-vertex tree of maximum degree...
متن کاملMaximum Plane Trees in Multipartite Geometric Graphs
A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-line segments between the points. A plane spanning tree in a geometric graph is a spanning tree that is non-crossing. Let R and B be two disjoint sets of points in the plane where the points of R are colored red and the points of B are colored blue, and let n = |R ∪ B|. A bichromatic plane spanning ...
متن کاملData Structures for On-Line Updating of Minimum Spanning Trees, with Applications
Data structures are presented for the problem of maintaining a. minimum spanning tree on-line under the operation of updating the cost of some edge in the graph. For the case of a general graph, maintaining the data structure and updating the tree are shown to take O(vm) time. where m is the number of edges in the graph. For the case of a planar graph, a data structure is presented which suppor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Discrete Algorithms
دوره 7 شماره
صفحات -
تاریخ انتشار 2009